MeshUDF: Fast and Differentiable Meshing of Unsigned Distance Field Networks
نویسندگان
چکیده
Unsigned Distance Fields (UDFs) can be used to represent non-watertight surfaces. However, current approaches converting them into explicit meshes tend either expensive or degrade the accuracy. Here, we extend marching cube algorithm handle UDFs, both fast and accurately. Moreover, our approach surface extraction is differentiable, which key using pretrained UDF networks fit sparse data.
منابع مشابه
On the complexity of unsigned translocation distance
Translocation is one of the basic operations for genome rearrangement. Translocation distance is the minimum number of translocations required to transform one genome into the other. In this paper, we show that computing the translocation distance for unsigned genomes is NP-hard. Moreover, we show that approximating the translocation distance for unsigned genomes within ratio 1.00017 is NP-hard...
متن کاملMarching Cubes in an Unsigned Distance Field for Surface Reconstruction from Unorganized Point Sets
Surface reconstruction from unorganized point set is a common problem in computer graphics. Generation of the signed distance field from the point set is a common methodology for the surface reconstruction. The reconstruction of implicit surfaces is made with the algorithm of marching cubes, but the distance field of a point set can not be processed with marching cubes because the unsigned natu...
متن کاملFast Multiresolution Surface Meshing
We present a new method for adaptive surface meshing and triangulation which controls the local level–of–detail of the surface approximation by local spectral estimates. These estimates are determined by a wavelet representation of the surface data. The basic idea is to decompose the initial data set by means of an orthogonal or semi–orthogonal tensor product wavelet transform (WT) and to analy...
متن کاملFast Sizing Calculations for Meshing
Provably correct algorithms for meshing difficult domains in three dimensions have been recently developed in the literature. These algorithms handle the problem of sharp angles (< π/2) between segments and between facets by constructing protective collars around these regions. The collars are approximately sized according to the local feature size of the input. With the eventual goal of develo...
متن کاملFast Distance Field Computation Using Graphics Hardware
We present an algorithm for fast computation of discretized 3D distance fields using graphics hardware. Given a set of primitives and a distance metric, our algorithm computes the distance field for each slice of a uniform spatial grid by rasterizing the distance functions of the primitives. We compute bounds on the spatial extent of the Voronoi region of each primitive. These bounds are used t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-20062-5_33